Toom-Cook Multiplication: Some Theoretical and Practical Aspects

نویسنده

  • M. J. Kronenburg
چکیده

Toom-Cook multiprecision multiplication is a well-known multiprecision multiplication method, which can make use of multiprocessor systems. In this paper the Toom-Cook complexity is derived, some explicit proofs of the Toom-Cook interpolation method are given, the even-odd method for interpolation is explained, and certain aspects of a 32-bit C++ and assembler implementation, which is in development, are discussed. A performance graph of this implementation is provided. The Toom-Cook method can also be used to multithread other types of multiplication, which is demonstrated for 32-bit GMP FFT multiplication.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ACTA UNIVERSITATIS APULENSIS Special Issue KARATSUBA AND TOOM-COOK METHODS FOR MULTIVARIATE POLYNOMIALS

Karatsuba and Toom-Cook are well-known methods used to efficiently multiply univariate polynomials and long integers. For multivariate polynomials, asymptotically good approaches like Kronecker’s trick combined with FFT become truly effective only when the degree is above some threshold. In this paper we analyze Karatsuba and some of Toom-Cook methods for multivariate polynomials, considering d...

متن کامل

Some Toom-Cook Methods For Even Long Integers

We present a new approach to evaluation and interpolation phases of some (balanced and unbalanced) Toom-Cook multiplication methods for long integers when at least one factor is even. Some other optimization are also indicated. AMS Subject Classification: 11A05, 11A25, 11K65, 11Y70

متن کامل

Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic

Toom-Cook strategy is a well-known method for building algorithms to efficiently multiply dense univariate polynomials. Efficiency of the algorithm depends on the choice of interpolation points and on the exact sequence of operations for evaluation and interpolation. If carefully tuned, it gives the fastest algorithm for a wide range of inputs. This work smoothly extends the Toom strategy to po...

متن کامل

Notes on Low Degree Toom-Cook Multiplication with Small Characteristic

The use of Toom-Cook sub-quadratic polynomial multiplication was recently shown to be possible also when the coefficient field does not have elements enough, particularly for F2[x]. This paper focus on how Toom’s strategies can be adapted to polynomials on non-binary small fields. In particular we describe the Toom-3 algorithm for Fp[x] with p ∈ {3, 5, 7}, and some other unbalanced algorithms. ...

متن کامل

What About Toom-Cook Matrices Optimality ?

Karatsuba and Toom-Cook are well-known methods used to multiply efficiently two long integers. There have been different proposal about the interpolating values used to determine the matrix to be inverted and the sequence of operations to invert it. A definitive word about which is the optimal matrix (values) and the (number of) basic operations to invert it seems still not to have been said. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1602.02740  شماره 

صفحات  -

تاریخ انتشار 2016